Transfinite descending sequences of models HODα
نویسندگان
چکیده
منابع مشابه
Reasoning About Transfinite Sequences
We introduce a family of temporal logics to specify the behavior of systems with Zeno behaviors. We extend linear-time temporal logic LTL to authorize models admitting Zeno sequences of actions and quantitative temporal operators indexed by ordinals replace the standard next-time and until future-time operators. Our aim is to control such systems by designing controllers that safely work on ω-s...
متن کاملTransfinite machine models
In recent years there has emerged the study of discrete computational models which are allowed to act transfinitely . By ‘discrete’ we mean that the machine models considered are not analogue machines, but compute by means of distinct stages or in units of time. The paradigm of such models is, of course, Turing’s original machine model. If we concentrate on this for a moment, the machine is con...
متن کاملReasoning about transfinite sequences (extended abtract)
We introduce a family of temporal logics to specify the behavior of systems with Zeno behaviors. We extend linear-time temporal logic LTL to authorize models admitting Zeno sequences of actions and quantitative temporal operators indexed by ordinals replace the standard next-time and until future-time operators. Our aim is to control such systems by designing controllers that safely work on ω-s...
متن کاملKripke Models of Transfinite Provability Logic
For any ordinal Λ, we can define a polymodal logic GLPΛ, with a modality [ξ] for each ξ < Λ. These represent provability predicates of increasing strength. Although GLPΛ has no non-trivial Kripke frames, Ignatiev showed that indeed one can construct a universal Kripke frame for the variable-free fragment with natural number modalities, denoted GLPω. In this paper we show how to extend these con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematical Logic
سال: 1981
ISSN: 0003-4843
DOI: 10.1016/0003-4843(81)90003-6